Soliton automata with constant external edges
نویسنده
چکیده
Soliton automata are the mathematical models of certain possible molecular switching devices. Both from theoretical and practical point of view, it is a central question to describe soliton automata with constant external edges. Extending a result of Dassow and Jürgensen, we characterize soliton automata in this special case.
منابع مشابه
Nondeterministic soliton automata with a single external vertex
Soliton automata are the mathematical models of certain possible molecular switching devices called soliton circuits. Both from theoretical and practical point of view, it is a central question to describe soliton automata with a single external vertex. Extending a result of Dassow and Jürgensen, we characterize nondeterministic automata in this special case.
متن کاملSimulation of Soliton Circuits
Soliton circuits are among the most promising alternatives for molecular electronic devices based on the design of molecular level conventional digital circuits. In order to capture the logical and computational aspects of these circuits, a mathematical model called soliton automaton was introduced by Dassow and Jürgensen in 1990. The underlying object of a soliton automaton is a so called soli...
متن کاملDeciding the deterministic property for soliton graphs
Soliton automata are a mathematical model for electronic switching at the molecular level. In the design of soliton circuits, deterministic automata are of primary importance. The underlying graphs of such automata, called soliton grahs, are characterized in terms of generalized trees and graphs having a unique perfect matching. Based on this characterization, a modification of the currently mo...
متن کاملUsing an Evaluator Fixed Structure Learning Automata in Sampling of Social Networks
Social networks are streaming, diverse and include a wide range of edges so that continuously evolves over time and formed by the activities among users (such as tweets, emails, etc.), where each activity among its users, adds an edge to the network graph. Despite their popularities, the dynamicity and large size of most social networks make it difficult or impossible to study the entire networ...
متن کاملCloud modeling of quasi - order groups on general fuzzy automata
In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 206 شماره
صفحات -
تاریخ انتشار 2008